#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#include<algorithm>
#include<queue>
#include<iostream>
using namespace std;


char s[10005];
vector<int> d;

long long gcd(long long a, long long b )
{
	while(b)
	{
		a %= b;
		swap(a, b);
	}
	return a;
}

int main()
{
	while(1)
	{
		scanf("%s", s);
		if(s[0] == '#')
			break;

		d.clear();

		for(int i = 0; s[i];)
		{
			if(s[i] == 'n')
			{
				d.push_back(-1);
				i += 5;
			}
			else
			{
				d.push_back(1);
				i += 4;
			}
		}

		reverse(d.begin(), d.end());

		int n = d.size();
		long long ch = 0, zn = 1, pw = 2;
		if(d[0] == 1)
			ch = 90;
		for(int i = 1; i < n; i++, pw *= 2)
		{
			long long tch = 90, tzn = pw;
			long long nd = gcd(tch, tzn);
			tch /= nd;
			tzn /= nd;
			tch *= d[i];

			nd = gcd(zn, tzn);
			ch *= tzn / nd;
			tch *= zn / nd;
			ch += tch;
			zn *= tzn / nd;

			nd = gcd(ch * (ch > 0 ? 1 : -1), zn);
			ch /= nd;
			zn /= nd;
		}

		printf("%lld", ch);
		if(zn != 1)
			printf("/%lld", zn);
		printf("\n");
	}

	return 0;
}
